


void test1()
{
	int a[10] = { 1,3,4,6,8 };
	int n = 5;

	InsertSort2(a, n, 5);

	Print(a, 6);
	//int a[] = { 2,2,2,2,2,2,2,2,2,2 };

}

void test2()
{
	//int a[] = { 6,6,6,7,6,6,4,6,6,8 };
	int a[] = { 6,5,3,8,9,4,2,6,1,4};



	int n = 10;

	//QuickSort(a, 0, n - 1);
	QuickSortNoR(a, 0, n - 1);
	Print(a, n);

}


int main()
{
	//int a[] = { 9,8,7,6,5,4,3,2,1 };
	//int a[] = { 1,2,3,4,5,6,7,8,9 };
	int a[] = { 6,5,3,8,9,4,2,6,1};
	int n = 9;
	//InsertSort(a, n);
	//ShellSort(a, n);
	//SelectSort(a, n);
	//BubbleSort(a, n);
	//QuickSort(a, 0, n - 1);
	QuickSortNoR(a,0,n-1);
	//MergeSort(a, n - 1);
	//MergeSortNonR(a, n);
	//TestOP();
	//test2();
	Print(a, n);

	return 0;
}